Pareto-Optimal Bit Allocation for Collaborative Intelligence

نویسندگان

چکیده

In recent studies, collaborative intelligence (CI) has emerged as a promising framework for deployment of Artificial Intelligence (AI)-based services on mobile/edge devices. CI, the AI model (a deep neural network) is split between edge and cloud, intermediate features are sent from sub-model to cloud sub-model. this paper, we study bit allocation feature coding in multi-stream CI systems. We task distortion function rate using convex surfaces similar those found distortion-rate theory. Using such models, able provide closed-form solutions single-task systems scalarized multi-task Moreover, analytical characterization full Pareto set 2-stream k-task systems, bounds 3-stream 2-task Analytical results examined variety DNN models literature demonstrate wide applicability

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal bit allocation for low bit rate video streaming applications

Current rate control schemes in video coding standards do not have efficient frame-level bit allocation because of the inherent constraints in real-time encoding. In this paper, we assume an offline video encoding environment and proposed a rate control scheme based on optimal bit allocation for low bit rate streaming applications. Specifically, at the encoder, we code each video sequence in tw...

متن کامل

Optimal bit allocation under multiple

We present a new Lagrangian-based iterative technique for rate{distortion optimization under multiple rate constraints. We show how for sets of \lin-ear" constraints this technique can be proven to be optimal up to a convex hull approximation. As an application we consider the problem of optimal buuer-constrained bit allocation. Our technique can be used to nd an excellent approximation to the ...

متن کامل

Pareto Optimal Allocation under Uncertain Preferences

The assignment problem is one of the most wellstudied settings in social choice, matching, and discrete allocation. We consider this problem with the additional feature that agents’ preferences involve uncertainty. The setting with uncertainty leads to a number of interesting questions including the following ones. How to compute an assignment with the highest probability of being Pareto optima...

متن کامل

Pareto-optimal matching allocation mechanisms for boundedly rational agents

Is the Pareto optimality of matching mechanisms robust to the introduction of boundedly rational behavior? To address this question I define a restrictive and a permissive notion of Pareto optimality and consider the large set of hierarchical exchange mechanisms which contains serial dictatorship as well as Gale’s top trading cycles. Fix a housing problem with boundedly rational agents and a hi...

متن کامل

a benchmarking approach to optimal asset allocation for insurers and pension funds

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on image processing

سال: 2021

ISSN: ['1057-7149', '1941-0042']

DOI: https://doi.org/10.1109/tip.2021.3060875